TDMA scheduling algorithms for wireless sensor networks
نویسندگان
چکیده
Algorithms for scheduling TDMA transmissions in multi-hop networks usually determine the smallest length conflict-free assignment of slots in which each link or node is activated at least once. This is based on the assumption that there are many independent point-to-point flows in the network. In sensor networks however often data are transferred from the sensor nodes to a few central data collectors. The scheduling problem is therefore to determine the smallest length conflict-free assignment of slots during which the packets generated at each node reach their destination. The conflicting node transmissions are determined based on an interference graph, which may be different from connectivity graph due to the broadcast nature of wireless transmissions. We show that this problem is NP-complete. We first propose two centralized heuristic algorithms: one based on direct scheduling of the nodes or node-based scheduling, which is adapted from classical multi-hop scheduling algorithms for general ad hoc networks, and the other based on scheduling the levels in the routing tree before scheduling the nodes or levelbased scheduling, which is a novel scheduling algorithm for many-to-one communication in sensor networks. The performance of these algorithms depends on the distribution of the nodes across the levels. We then propose a distributed algorithm based on the distributed coloring of the nodes, that increases the delay by a factor of 10–70 over centralized algorithms for 1000 nodes. We also obtain upper bound for these schedules as a function of the total number of packets generated in the network.
منابع مشابه
A Survey on Scheduling Algorithms for Wireless Sensor Networks
Wireless sensor networks(WSN) have wide range of application such as traffic analysis, environmental monitoring, industrial process monitoring, and tactical systems. Large-scale wireless sensor networks are expected to play increasingly important role in future civilian and military application. Designing of MAC layer protocol for wireless sensor network is a challenging task due to limited bat...
متن کاملSAS-TDMA: a source aware scheduling algorithm for real-time communication in industrial wireless sensor networks
Scheduling algorithms play an important role for TDMA-based wireless sensor networks. Existing TDMA scheduling algorithms address a multitude of objectives. However, their adaptation to the dynamics of a realistic wireless sensor network has not been investigated in a satisfactory manner. This is a key issue considering the challenges within industrial applications for wireless sensor networks,...
متن کاملA JOINT DUTY CYCLE SCHEDULING AND ENERGY AWARE ROUTING APPROACH BASED ON EVOLUTIONARY GAME FOR WIRELESS SENSOR NETWORKS
Network throughput and energy conservation are two conflicting important performance metrics for wireless sensor networks. Since these two objectives are in conflict with each other, it is difficult to achieve them simultaneously. In this paper, a joint duty cycle scheduling and energy aware routing approach is proposed based on evolutionary game theory which is called DREG. Making a trade-off ...
متن کاملCluster Based Time Division Multiple Access Scheduling Scheme for Zigbee Wireless Sensor Networks
In IEEE 802.15.4 ZigBee Wireless Sensor Networks, an efficient scheduling mechanism is required for reliable data transmission. Further, concurrent transmission of huge data through CSMA/CA incurs more packet collision rate. This complicated condition has to be eliminated to improve the system throughput. In this study, we propose to deploy cluster based TDMA scheduling mechanism for IEEE 802.1...
متن کاملQuasi Random Deployment Strategy for Reliable Communication Backbones in Wireless Sensor Networks
Topology construction and topology maintenance are significant sub-problems of topology control. Spanning tree based algorithms for topology control are basically transmission range based type construction algorithms. The construction of an effective backbone, however, is indirectly related to the placement of nodes. Also, the dependence of network reliability on the communication path undertak...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Wireless Networks
دوره 16 شماره
صفحات -
تاریخ انتشار 2010